Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
نویسندگان
چکیده
منابع مشابه
Diophantine Approximation and Analytic Number Theory
This conference dealt with two areas of Number Theory, “the queen of mathematics.” Diophantine approximation can be broadly described as the solvability in rational integers to various inequalities. The name comes from the later Greek mathematician Diophantus, who studied the solutions to certain equations. Though clearly a very old branch of mathematics, it remains a vibrant area of study to t...
متن کاملDistributed computing of simultaneous Diophantine approximation problems
In this paper we present the Multithreaded Advanced Fast Rational Approximation algorithm – MAFRA – for solving n-dimensional simultaneous Diophantine approximation problems. We show that in some particular applications the Lenstra-Lenstra-Lovász (L) algorithm can be substituted by the presented one in order to reduce their practical running time. MAFRA was implemented in the following architec...
متن کاملTwo Upper Bounds on the Chromatic Number
Processor cache memory management is a challenging issue as it deeply impact performances and power consumption of electronic devices. It has been shown that allocating data structures to memory for a given application (as MPEG encoding, filtering or any other signal processing application) can be modeled as a minimum k-weighted graph coloring problem, on the so-called conflict graph. The graph...
متن کاملOn Lacunary Almost Convergent Sequences
The purpose of this paper is to define and study the spaces [ĉ,M, p](∆u , q, s), [ĉ,M, p, ] θ 0(∆ m u , q, s) and [ĉ,M, p, ] θ ∞(∆ m u , q, s) of lacunary convergent sequences. We also study some inclusion relations between these spaces and some properties and theorems. 2000 Mathematics Subject Classification:40D05, 40A05. 1.Introduction and definitions Let w denote the set of all complex seque...
متن کاملTwo results on the digraph chromatic number
It is known (Bollobás [4]; Kostochka and Mazurova [13]) that there exist graphs of maximum degree ∆ and of arbitrarily large girth whose chromatic number is at least c∆/ log ∆. We show an analogous result for digraphs where the chromatic number of a digraph D is defined as the minimum integer k so that V (D) can be partitioned into k acyclic sets, and the girth is the length of the shortest cyc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the London Mathematical Society
سال: 2010
ISSN: 0024-6093
DOI: 10.1112/blms/bdp126